A SAT-based Method for Solving the Two-dimensional Strip Packing Problem

نویسندگان

  • Takehide Soh
  • Katsumi Inoue
  • Naoyuki Tamura
  • Mutsunori Banbara
  • Hidetomo Nabeshima
چکیده

We propose a satisfiability testing (SAT) based exact approach for solving the two-dimensional strip packing problem (2SPP). In this problem, we are given a set of rectangles and one large rectangle called a strip. The goal of the problem is to pack all rectangles without overlap, into the strip by minimizing the overall height of the packing. We show the method solves a 2SPP by translating it to SAT problems through a SAT encoding called order encoding. Generated SAT problems tend to be large, then we show techniques to reduce the search space by utilizing symmetries and relations of rectangles. To solve a 2SPP, that is, to compute the minimum height of a 2SPP, we need to repeatedly solve similar SAT problems. We then reuse learned clauses, assumptions, and models, which are obtained from previously solved SAT problems, to efficiently compute the minimum height. We attempt to solve 38 instances from the literature and obtain the total of 29 optimal solutions, including the solutions of two open problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem

In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...

متن کامل

Symmetry breaking generalized disjunctive formulation for the strip packing problem

The two-dimensional strip packing is a special case of “Cutting and Packing” problems that arises in many applications. The problem seeks to pack a given set of rectangles into a strip of given width in order to minimize its length. Some applications in which the strip packing problem arises are: Cutting pieces from wooden boards, cutting pieces from glass or steel sheets, optimal layout of ind...

متن کامل

A new metaheuristic genetic-based placement algorithm for 2D strip packing

Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...

متن کامل

 Abstract: Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The obj...

متن کامل

Elzaki transform method for finding solutions to two-dimensional elasticity problems in polar coordinates formulated using Airy stress functions

In this paper, the Elzaki transform method is used for solving two-dimensional (2D) elasticity problems in plane polar coordinates. Airy stress function was used to express the stress compatibility equation as a biharmonic equation. Elzaki transform was applied with respect to the radial coordinate to a modified form of the stress compatibility equation, and the biharmonic equation simplified t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Fundam. Inform.

دوره 102  شماره 

صفحات  -

تاریخ انتشار 2010